Computing Minkowski Sum of Periodic Surface Models
نویسنده
چکیده
Recently we proposed a periodic surface model to assist geometric construction in computer-aided nano-design. This implicit surface model helps create super-porous nano structures parametrically and support crystal packing. In this paper, we study construction methods of Minkowski sums for periodic surfaces. A numerical approximation approach based on the Chebyshev polynomials is developed and can be applied in the formulations of surface normal direction matching and volume translations.
منابع مشابه
Minkowski sum boundary surfaces of 3D-objects
Given two solids A and B with piecewise smooth boundary we discuss the computation of the boundary Γ of the Minkowski sum A + B. This boundary surface Γ is part of the envelope when B is moved by translations defined by vectors a ∈ A, or vice versa. We present an efficient algorithm working for dense point clouds or for triangular meshes. Besides this, the global self intersections of the bound...
متن کاملComputing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums
A global visibility map is a spherical image built to describe the complete set of global visible view directions for a surface. In this paper, we consider the computation of global visibility maps for regions on the boundary of a polyhedron. Both the self-occlusions introduced by a region and the global occlusions introduced by the rest of the surfaces on the boundary of the polyhedron are con...
متن کاملVoxelized Minkowski sum computation on the GPU with robust culling
We present a new approach for computing the voxelized Minkowski sum (excluding any enclosed voids) of two polyhedral objects using programmable Graphics Processing Units (GPUs). We first cull out surface primitives that will not contribute to the final boundary of the Minkowski sum, analyzing and adaptively bounding the rounding errors of the culling algorithm to solve the floating point error ...
متن کاملA Simple Method for Computing Minkowski Sum Boundary in 3D
Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3-d Minkowski sum software for general polyhedra is available to the public. One of the main reasons is the difficulty of implementing the existing methods. There are two main approaches for computing Minkowski sums:...
متن کاملAccurate Sampling-Based Algorithms for Surface Extraction and Motion Planning
GOKUL VARADHAN: Accurate Sampling-Based Algorithms for Surface Extraction and Motion Planning. (Under the direction of Dinesh Manocha.) Boolean operations, Minkowski sum evaluation, configuration space computation, and motion planning are fundamental problems in solid modeling and robotics. Their applications include computer-aided design, numerically-controlled machining, tolerance verificatio...
متن کامل